Graph attention neural network for water network partitioning
نویسندگان
چکیده
Abstract Partitioning a water distribution network into several district metered areas is beneficial for its management. according to node features and connections remains challenge. A recent study has realized partitioning based on or pipe individually. This proposes an unsupervised clustering method nodes graph neural network, which uses attention technology update the cluster nodes. The similarity between located in each area balance of total demand are optimized, importance boundary pipes calculated determine installation position flowmeters valves. Three networks with different structures sizes used verify proposed model. results show that average location differences (LocDiffs) within three completed by 0.12, 0.07, 0.06, (DemDiffs) 0.13, 0.27, 0.29, respectively. LocDiff DemDiff decreased 6% 55%, respectively, when compared traditional method. Additionally, calculating boundaries provides objective basis closure. When same number closed, comprehensive impact decreases 17.1%. can be practical applications because it ensures highly reliable interpretive
منابع مشابه
Attention-based Graph Neural Network for Semi-supervised Learning
Recently popularized graph neural networks achieve the state-of-the-art accuracy on a number of standard benchmark datasets for graph-based semi-supervised learning, improving significantly over existing approaches. These architectures alternate between a propagation layer that aggregates the hidden states of the local neighborhood and a fully-connected layer. Perhaps surprisingly, we show that...
متن کاملRefining Graph Partitioning for Social Network Clustering
Graph partitioning is a traditional problem with many applications and a number of high-quality algorithms have been developed. Recently, demand for social network analysis arouses the new research interest on graph clustering. Social networks differ from conventional graphs in that they exhibit some key properties which are largely neglected in popular partitioning algorithms. In this paper, w...
متن کاملContinuous graph partitioning for camera network surveillance
In this note we discuss a novel graph partitioning problem, namely continuous graph partitioning, and we discuss its application to the design of surveillance trajectories for camera networks. In continuous graph partitioning, each edge is partitioned in a continuous fashion between its endpoint vertices, and the objective is to minimize the largest load among the vertices. We show that the con...
متن کاملAnt algorithm for smart water network partitioning
Applying ICT devices to WDS makes it possible to introduce also the new concept of Smart WAter Network (SWAN), as a key Smart City subsystem, improving the traditional management of WDS. The possibility of inserting remote-controlled valves and flow meters in a WDS allows to divide a water network into k smaller subsystems, in order to improve the management and protection of WDS. This study pr...
متن کاملInput Space Partitioning for Neural Network Learning
Neural Network (NN) is a supervised machine learning technique, which is typically employed to solve classification problems. When solving a classification problem with the conventional NN, the input data fed into the NN often consists of multiple attributes of various properties. However, training the NN with all of the available input attributes may not lead to the desirable performance consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Water Science
سال: 2022
ISSN: ['2190-5495', '2190-5487']
DOI: https://doi.org/10.1007/s13201-022-01791-4